A Polynomial Kernel for Trivially Perfect Editing

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Polynomial Kernel for Diamond-Free Editing

An H-free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of the fixed graph H. We obtain a polynomial kernel for this problem when H is a diamond. The incompressibility dichotomy for H being a 3-connected graph [4] and the classical complexity dichotomy [1] suggest that except for H being a complete/empty graph, Hfree editing problems admit poly...

متن کامل

A new characterization of trivially perfect graphs

A graph G is trivially perfect if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) α(G) equals the number of (maximal) cliques m(G). We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

متن کامل

Probe threshold and probe trivially perfect graphs

7 An undirected graph G = (V,E) is a probe C graph if its vertex set can be partitioned 8 into two sets, N (non-probes) and P (probes) where N is independent and there 9 exists E′ ⊆ N × N such that G′ = (V,E ∪ E′) is a C graph. In this article we 10 investigate probe threshold and probe trivially perfect graphs and characterise them 11 in terms of certain 2-Sat formulas and in other ways. For t...

متن کامل

Linear-time certifying algorithms for recognizing trivially perfect graphs

We give the first linear-time certifying algorithms to recognize trivially perfect graphs, with sublinear certificates for negative output. In case of membership in the class of trivially perfect graphs, our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membership they provide as certificate a forbidden induced subgraph of the...

متن کامل

Nonparametric Regression Estimation under Kernel Polynomial Model for Unstructured Data

The nonparametric estimation(NE) of kernel polynomial regression (KPR) model is a powerful tool to visually depict the effect of covariates on response variable, when there exist unstructured and heterogeneous data. In this paper we introduce KPR model that is the mixture of nonparametric regression models with bootstrap algorithm, which is considered in a heterogeneous and unstructured framewo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2017

ISSN: 0178-4617,1432-0541

DOI: 10.1007/s00453-017-0401-6